%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SEV240^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 19:24:34 EDT 2023

% Result   : Theorem 3.51s 3.77s
% Output   : Proof 3.51s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEV240^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command    : duper %s
% 0.14/0.34  % Computer : n018.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Thu Aug 24 02:58:12 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.51/3.77  SZS status Theorem for theBenchmark.p
% 3.51/3.77  SZS output start Proof for theBenchmark.p
% 3.51/3.77  Clause #0 (by assumption #[]): Eq (Not (∀ (Xx : a → Prop), cA Xx → ∀ (Xx0 : a), Xx Xx0 → Exists fun S => And (cA S) (S Xx0))) True
% 3.51/3.77  Clause #1 (by clausification #[0]): Eq (∀ (Xx : a → Prop), cA Xx → ∀ (Xx0 : a), Xx Xx0 → Exists fun S => And (cA S) (S Xx0)) False
% 3.51/3.77  Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop), Eq (Not (cA (skS.0 0 a_1) → ∀ (Xx0 : a), skS.0 0 a_1 Xx0 → Exists fun S => And (cA S) (S Xx0))) True
% 3.51/3.77  Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop), Eq (cA (skS.0 0 a_1) → ∀ (Xx0 : a), skS.0 0 a_1 Xx0 → Exists fun S => And (cA S) (S Xx0)) False
% 3.51/3.77  Clause #4 (by clausification #[3]): ∀ (a_1 : a → Prop), Eq (cA (skS.0 0 a_1)) True
% 3.51/3.77  Clause #5 (by clausification #[3]): ∀ (a_1 : a → Prop), Eq (∀ (Xx0 : a), skS.0 0 a_1 Xx0 → Exists fun S => And (cA S) (S Xx0)) False
% 3.51/3.77  Clause #6 (by clausification #[5]): ∀ (a_1 : a → Prop) (a_2 : a),
% 3.51/3.77    Eq (Not (skS.0 0 a_1 (skS.0 1 a_1 a_2) → Exists fun S => And (cA S) (S (skS.0 1 a_1 a_2)))) True
% 3.51/3.77  Clause #7 (by clausification #[6]): ∀ (a_1 : a → Prop) (a_2 : a),
% 3.51/3.77    Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) → Exists fun S => And (cA S) (S (skS.0 1 a_1 a_2))) False
% 3.51/3.77  Clause #8 (by clausification #[7]): ∀ (a_1 : a → Prop) (a_2 : a), Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2)) True
% 3.51/3.77  Clause #9 (by clausification #[7]): ∀ (a_1 : a → Prop) (a_2 : a), Eq (Exists fun S => And (cA S) (S (skS.0 1 a_1 a_2))) False
% 3.51/3.77  Clause #10 (by clausification #[9]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (And (cA a_1) (a_1 (skS.0 1 a_2 a_3))) False
% 3.51/3.77  Clause #11 (by clausification #[10]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Or (Eq (cA a_1) False) (Eq (a_1 (skS.0 1 a_2 a_3)) False)
% 3.51/3.77  Clause #12 (by superposition #[11, 4]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Or (Eq ((fun x => skS.0 0 a_1 x) (skS.0 1 a_2 a_3)) False) (Eq False True)
% 3.51/3.77  Clause #13 (by betaEtaReduce #[12]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Or (Eq (skS.0 0 a_1 (skS.0 1 a_2 a_3)) False) (Eq False True)
% 3.51/3.77  Clause #14 (by clausification #[13]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 0 a_1 (skS.0 1 a_2 a_3)) False
% 3.51/3.77  Clause #15 (by superposition #[14, 8]): Eq False True
% 3.51/3.77  Clause #16 (by clausification #[15]): False
% 3.51/3.77  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------